there is a need to analyze and map rainfall erosivity to assess soil erosion at the regional scale. the objectives of this study were to develop a regional model to estimate seasonal erosivity from seasonal rainfall data and to study temporal and spatial distribution of rainfall erosivity for the gorganrood drainage basin in the northeast of iran. six gauging stations with a high temporal resol...

there is a need to analyze and map rainfall erosivity to assess soil erosion at the regional scale. the objectives of this study were to develop a regional model to estimate seasonal erosivity from seasonal rainfall data and to study temporal and spatial distribution of rainfall erosivity for the gorganrood drainage basin in the northeast of iran. six gauging stations with a high temporal reso...

In this paper, a robust autopilot is proposed using stable interpolation based on Youla parameterization. The most important condition of stable interpolation between local controllers is the preservation of stability so that each local controller can ensure stability for an open neighborhood around a nominal point. The proposed design used fixed-order robust controller with parameter-dependent...

The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...

This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

The problem of the distribution of dairy products, which is classified as a combinatorial optimization problem, cannot be solved in polynomial time. In this paper, an algorithm based on Ant Colony Hybrid meta-heuristic system and Geographic Information System (GIS) was used to find a near-optimal solution to this problem. Using the former method, the nearest neighbor heuristic algorithm was use...

this work presents a hybrid method for motif discovery in dna sequences. the proposed method called spso-lk, borrows the concept of chebyshev polynomials and uses the stochastic local search to improve the performance of the basic pso algorithm as a motif finder. the chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...